Vertex transitive graphs G with χ_D(G) > χ(G) and small automorphism group
نویسندگان
چکیده
منابع مشابه
On cycle decompositions with a sharply vertex transitive automorphism group
In some recent papers the method of partial differences introduced by the author in [4] was very helpful in the construction of cyclic cycle systems. Here we use and describe in all details this method for the more general purpose of constructing cycle decompositions with a sharply vertex transitive automorphism group not necessarily cyclic.
متن کاملAUTOMORPHISM GROUPS OF SOME NON-TRANSITIVE GRAPHS
An Euclidean graph associated with a molecule is defined by a weighted graph with adjacency matrix M = [dij], where for ij, dij is the Euclidean distance between the nuclei i and j. In this matrix dii can be taken as zero if all the nuclei are equivalent. Otherwise, one may introduce different weights for distinct nuclei. Balaban introduced some monster graphs and then Randic computed complexit...
متن کاملQuantum automorphism groups of vertex - transitive graphs of order ≤ 11
We study quantum automorphism groups of vertex-transitive graphs having less than 11 vertices. With one possible exception, these can be obtained from cyclic groups Zn , symmetric groups Sn and quantum symmetric groups Qn , by using various product operations. The exceptional case is that of the Petersen graph, and we present some questions about it.
متن کاملAll vertex-transitive locally-quasiprimitive graphs have a semiregular automorphism
The polycirculant conjecture states that every transitive 2-closed permutation group of degree at least two contains a nonidentity semiregular element, that is, a nontrivial permutation whose cycles all have the same length. This would imply that every vertex-transitive digraph with at least two vertices has a nonidentity semiregular automorphism. In this paper we make substantial progress on t...
متن کاملDistance Transitive Graphs with Symmetric or Alternating Automorphism Group
for some n , acting primitively on the set of vertices. This forms a part of the programme for the classification of all finite primitive distance transitive graphs begun in [76]; for in [76] this classification is reduced to the determination of all such graphs whose automorphism group G is either almost simple (that is, T o f f S Aut T for some nonabelian simple group T ) or affine (that is, ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Ars Mathematica Contemporanea
سال: 2019
ISSN: 1855-3974,1855-3966
DOI: 10.26493/1855-3974.1435.c71